منابع مشابه
On Proving Limiting Completeness
We give two proofs of Wadsworth's classic approximation theorem for the pure A-calculus. One of these illustrates a new method utilising a certain kind of intermediate semantics for proving correspondences between denotational and operational semantics. The other illustrates a direct technique of Milne, employing recursively-specified inclusive relations.
متن کاملProving Ground Completeness of Resolution by Proof Planning Proving Ground Completeness of Resolution by Proof Planning
A lot of the human ability to prove hard mathematical theorems can be ascribed to a domain-speciic problem solving know-how. Such knowledge is intrin-sically incomplete. In order to solve related problems, human mathematicians can go beyond their acquired knowledge by adapting their know-how. These two aspects, having rich experience and extending it by need, can be simulated in a proof plannin...
متن کاملProving Completeness for Nested Sequent Calculi
Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there is, going back to Lindenbaum (though not actually published by him). It has been extended to a variety of logical formalisms, sometimes combined with the addition of Henkin constants to handle quantifiers. Recently a deep-reasoning formalism called nested sequents h...
متن کاملProving the Completeness Theorem within Isabelle/HOL
This is a report about formalising a maths proof with the theorem prover Isabelle/HOL. The proof was for the completeness theorem of first order logic. The informal proof used symmetry arguments (duality) and also gave the cut elimination theorem as a corollary. Both these aspects were preserved formally. The paper outlines this formalisation. It notes that parts of the proof can be viewed as a...
متن کاملProving Correctness and Completeness of Normal Programs - A Declarative Approach
We advocate a declarative approach to proving properties of logic programs. Total cor-rectness can be separated into correctness, completeness and clean termination; the latter includes non-floundering. Only clean termination depends on the operational semantics, in particular on the selection rule. We show how to deal with correctness and completeness in a declarative way, treating programs on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1987
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0216015